Applications of Orthogonal Arrays to Computer Science
نویسندگان
چکیده
Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisticians motivated by their applications to design of experiments. In recent years, they have found numerous applications in computer science. Among their applications are derandomization of algorithms, random pattern testing of VLSI chips, authentication codes, universal hash functions, threshold schemes, and perfect local randomizers. In this article, we survey the applications of orthogonal arrays to computer science. keywords: Orthogonal Arrays, Computer Science, Cryptography, Applications.
منابع مشابه
β-galactosidase Production by Aspergillus niger ATCC 9142 Using Inexpensive Substrates in Solid-State Fermentation: Optimization by Orthogonal Arrays Design
Background: Enzymatic hydrolysis of lactose is one of the most important biotechnological processes in the food industry, which is accomplished by enzyme β-galactosidase (β-gal, β-D-galactoside galactohydrolase, EC 3.2.1.23), trivial called lactase. Orthogonal arrays design is an appropriate option for the optimization of biotechnological processes for the production of microbial...
متن کاملSegmentation Assisted Object Distinction for Direct Volume Rendering
Ray Casting is a direct volume rendering technique for visualizing 3D arrays of sampled data. It has vital applications in medical and biological imaging. Nevertheless, it is inherently open to cluttered classification results. It suffers from overlapping transfer function values and lacks a sufficiently powerful voxel parsing mechanism for object distinction. In this work, we are proposing an ...
متن کاملOn Construction of a Class of Orthogonal Arrays
We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The effectiveness of the proposed algorithm lies in the fact that it works well with any linear seed orthogonal array without imposing any constraints on the stren...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملOn Construction of a Class of Orthogonal Arrays (Thesis)
We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The effectiveness of the proposed algorithm lies in the fact that it works well with any linear seed orthogonal array without imposing any constraints on the stren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008